Maxstatic Sink Location Problem with Capacitated Sinks

The Maximum static flow problem, in a single-source-single-sink network, deals with finding the maximum amount of from source to sink. Given set possible sinks, identification sink that maximizes is an important optimization problem. In this work, we consider problem when sinks have given capacities. We devise simple network transformation so algorithms uncapacitated case can be used capacitated one proving solved strongly polynomial time complexity. Further, propose algorithm whose average-case complexity better than iterative procedure iterates over all sinks.